Robust Algorithms for TSP and Steiner Tree

Robust optimization is a widely studied area in operations research, where the algorithm takes as input range of values and outputs single solution that performs well for entire range. Specifically, robust aims to minimize regret , defined maximum difference between solution’s cost an optimal hindsight once has been realized. For graph problems P such shortest path minimum spanning tree, polynomial-time algorithms obtain constant approximation on are known. In this paper, we study minimizing NP -hard problems, give approximations classical traveling salesman Steiner tree problems.